package leetcode.other;

public class number1819 {
    public static void main(String[] args) {
        countDifferentSubsequenceGCDs(new int[]{6,10,3});
    }
    public static int countDifferentSubsequenceGCDs(int[] nums) {
        int maxNum = 0;
        for (int num : nums) {
            maxNum = Math.max(maxNum, num);
        }
        int[] dp = new int[maxNum + 1];
        for (int num : nums) {
            for (int i = 1; i <= maxNum; i++) {
                if (num % i == 0) {
                    dp[i] = Math.max(dp[i], num);
                }
            }
        }
        return 0;
    }
}
